Erratum to: Algorithms in unnormalized arithmetic. I. Recurrence relations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Radix Conversion in an Unnormalized Arithmetic System

Introduction. The question of radix conversion of variable-precision binary numbers arises naturally in the context of unnormalized number representation [1], but may be of interest in other situations where it is desired to have number representations carry a reflection of significance. The present paper discusses a method for binary-decimal conversion of unnormalized numbers; this method diff...

متن کامل

Recurrence relations and fast algorithms

We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the coefficients in linear combinations of the functions, given the values of these linear combinations at certain points, and, vice versa, for evaluating such linear combinations at those points, given the coefficients in t...

متن کامل

Theoretical Foundation of Algebraic Optimization Utilizing Unnormalized Relations

Unnormalized (NF2) relations, not conforming to the first normal form condition (lNF) of the relational model have been proposed recently for a variety of new applications. In this paper we extend NF2 relational theory in a way that it becomes possible to use NF2 relations as storage structures for conventionallNF relational database interfaces. Physical clustering of precomputed joins can be a...

متن کامل

Probabilistic Recurrence Relations for Work and Span of Parallel Algorithms

In this paper we present a method for obtaining tail-bounds for random variables satisfying certain probabilistic recurrences that arise in the analysis of randomized parallel divide and conquer algorithms. In such algorithms, some computation is initially done to process an input x, which is then randomly split into subproblems h1(x), . . . , hn(x), and the algorithm proceeds recursively in pa...

متن کامل

QED amplitudes: recurrence relations to all orders

We describe the origins of recurrence relations between field theory amplitudes in terms of the construction of Feynman diagrams. In application we derive recurrence relations for the amplitudes of QED which hold to all loop orders and for all combinations of external particles. These results may also be derived from the Schwinger-Dyson equations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Numerische Mathematik

سال: 1965

ISSN: 0029-599X,0945-3245

DOI: 10.1007/bf01436530